Gröbner bases via linkage

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Taylor and Lyubeznik Resolutions via Gröbner Bases

Taylor presented an explicit resolution for arbitrary monomial ideals. Later, Lyubeznik found that already a subcomplex defines a resolution. We show that the Taylor resolution may be obtained by repeated application of the Schreyer Theorem from the theory of Gröbner bases, whereas the Lyubeznik resolution is a consequence of Buchberger’s chain criterion. Finally, we relate Fröberg’s contractin...

متن کامل

Gröbner Bases via Linkage

In this paper, we give a sufficient condition for a set G of polynomials to be a Gröbner basis with respect to a given term-order for the ideal I that it generates. Our criterion depends on the linkage pattern of the ideal I and of the ideal generated by the initial terms of the elements of G. We then apply this criterion to ideals generated by minors and pfaffians. More precisely, we consider ...

متن کامل

Multiplicative Bases, Gröbner Bases, and Right Gröbner Bases

Before surveying the results of the paper, we introduce path algebras. Path algebras play a central role in the representation theory of finite-dimensional algebras (Gabriel, 1980; Auslander et al., 1995; Bardzell, 1997) and the theory of Gröbner bases (Bergman, 1978; Mora, 1986; Farkas et al., 1993) has been an important tool in some results (Feustel et al., 1993; Green and Huang, 1995; Bardze...

متن کامل

Regular Gröbner Bases

In Ufnarovski (1989), the concept of automaton algebras is introduced. These are quotients of the non-commutative polynomial ring where the defining ideal allows some Gröbner basis with a regular set of leading words. However, nothing is reflected concerning the whole structure of the Gröbner basis (except of course for monomial algebras). In this paper we introduce the concept of regular Gröbn...

متن کامل

Polynomial GCD and Factorization via Approximate Gröbner Bases

We discuss computation of approximate Gröbner bases at high but finite precision. We show how this can be used to deduce exact results for various applications. Examples include implicitizing surfaces, finding multivariate polynomial greatest common divisors and factorizations over the rational and complex number fields. This is an extended version of a paper for SYNASC 2010: Proceedings of the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2013

ISSN: 0021-8693

DOI: 10.1016/j.jalgebra.2013.02.017